Formally Validating a Practical Verification Condition Generator

Abstract A program verifier produces reliable results only if both the logic used to justify program’s correctness is sound, and implementation of itself correct. Whereas it common formally prove soundness logic, a typically remains unverified. Bugs in implementations may compromise trustworthiness successful verification results. Since verifiers practice are complex, evolving software systems, generally not feasible verify their implementation. In this paper, we present an alternative approach: validate runs widely-used Boogie by producing certificate which proves obtained result. performs complex series translations before ultimately generating condition whose validity should imply input program. We show how certify three Boogie’s core transformation phases: elimination cyclic control flow paths, (SSA-like) replacement assignments assumptions using fresh variables (passification), final generation conditions. Similar employed other verifiers. Our certificates Isabelle, based on novel formalisation language.